Subdivided Phase Oracle for NISQ Search Algorithms
نویسندگان
چکیده
منابع مشابه
SYMBIOTIC ORGANISMS SEARCH AND HARMONY SEARCH ALGORITHMS FOR DISCRETE OPTIMIZATION OF STRUCTURES
In this work, a new hybrid Symbiotic Organisms Search (SOS) algorithm introduced to design and optimize spatial and planar structures under structural constraints. The SOS algorithm is inspired by the interactive behavior between organisms to propagate in nature. But one of the disadvantages of the SOS algorithm is that due to its vast search space and a large number of organisms, it may trap i...
متن کاملRobust Quantum Algorithms for Oracle Identification
The oracle identification problem (OIP) was introduced by Ambainis et al. [4]. It is given as a set S of M oracles and a blackbox oracle f . Our task is to figure out which oracle in S is equal to the blackbox f by making queries to f . OIP includes several problems such as the Grover Search as special cases. In this paper, we improve the algorithms in [4] by providing a mostly optimal upper bo...
متن کاملHybridization of Cuckoo Search and Firefly Algorithms to Calculate the Interaction Parameters in Phase Equilibrium Modeling Problems
Liquid-liquid equilibrium (LLE) problems such as phase stability analysis, phase equilibrium calculations, chemical equilibrium calculations, binary interaction parameter identification of thermodynamic models and other problems of fluid characterization have been the core subject of many recent studies. This study introduces Cuckoo Search (CS), Firefly Algorithms (FA) and its variants as p...
متن کاملSearch Algorithm Using Factor Oracle as Index
A new almost linear time algorithm for indexed full-text search is presented. The algorithm uses a modified factor oracle as an index database. A factor oracle is an acyclic automaton made from an input text, and it recognizes all of substrings in the text. It can be built in time proportional to the text length, and it is more space economical and easy to implement comparing similar machinerie...
متن کاملQuantum parity algorithms as oracle calls, and application in Grover Database search
This paper discusses the determination of the parity of a string of N binary digits, the well-known problem in classical as well as quantum information processing. It can be formulated as an oracle problem. It has been established that quantum algorithms require at least N /2 oracle calls. We present an algorithm that reaches this lower bound and is also optimal in terms of additional gate oper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Quantum Engineering
سال: 2020
ISSN: 2689-1808
DOI: 10.1109/tqe.2020.3012068